A Translation of Model Elimination Proofs into a Structured Natural Deduction
نویسنده
چکیده
Model Elimination is a frequently used calculus in automated theorem proving (ATP). Powerful implementations are available. Unfortunately, the automatically generated proofs are not very readable for humans. The Block Calculus is a variant of Natural Deduction that makes it possible to generate struc-tured proofs. It is convenient for natural language proof presentation, and it is also usable for understanding the internal structures of machine generated proofs and for extracting proof schemes. This paper describes an algorithm for transforming Model Elimination proofs into the Block Calculus, preserving most parts of the original proof structure.
منابع مشابه
Semantic A-translation and Super-consistency entail Classical Cut Elimination
We show that if a theory R defined by a rewrite system is super-consistent, the classical sequent calculus modulo R enjoys the cut elimination property, which was an open question. For such theories it was already known that proofs strongly normalize in natural deduction modulo R, and that cut elimination holds in the intuitionistic sequent calculus modulo R. We first define a syntactic and a s...
متن کاملOn a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus
In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cut-elimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction. Then we define a reduction relation on those proofs that exactly corresponds to normalization in natural d...
متن کاملRevisiting the Correspondence between Cut Elimination and Normalisation
Cut-free proofs in Herbelin’s sequent calculus are in 1-1 correspondence with normal natural deduction proofs. For this reason Herbelin’s sequent calculus has been considered a privileged middle-point between L-systems and natural deduction. However, this bijection does not extend to proofs containing cuts and Herbelin observed that his cutelimination procedure is not isomorphic to β-reduction....
متن کاملStrong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedd...
متن کاملProving By Simplification
This notebook describes a simplification prover in natural deduction style. The prover is mainly a conditional term rewriting system used to generate abstract proof objects, i.e. structured data that contain enough information to describe all the individual steps in a proof. These proof objects can be regarded as standalone proofs, or can be further integrated into more complex proofs that use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996